Parliament seating assignment problems
نویسندگان
چکیده
Motivated by evidence that parliament seatings are relevant for decision making, we consider the problem to assign seats in a members of parliament. We prove resulting seating assignment is strongly NP-hard several restricted settings. present Mixed Integer Programming formulation problem, describe two families valid inequalities and discuss symmetry-breaking constraints. Further, design heuristic. Finally, compare outcomes with heuristic computational study.
منابع مشابه
Seating Assignment Using Constrained Signed Spectral Clustering
In this paper, we present a novel method for constrained cluster size signed spectral clustering (CSS) which allows us to subdivide large groups of people based on their relationships. In general, signed clustering only requires K hard clusters and does not constrain the cluster sizes. We extend signed clustering to include cluster size constraints. Using an example of seating assignment, we ef...
متن کاملAssignment Problems
Page 55 line 6: replace " among the matched " with " among the unmatched " ; 229 line 13: replace " Palubeckis [544] " with the following (missing) reference: G. Palubeckis. The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem. 289 eqn (9.27): replace " s ∈ F " with " S ∈ F " ; 308 line 14: replace " approximation algorithms which yield a feasible s...
متن کاملOnes Assignment Method for Solving Assignment Problems
Assignment problem is an important subject discussed in real physical world. We endeavor in this paper to introduce a new approach to assignment problem namely, ones assignment method, for solving a wide rang of such problems. This method offers significant advantages over similar methods, in the process, first we define the assignment matrix, then by using determinant representation we obtain ...
متن کاملA New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
متن کاملAssignment problems with complementarities
The problem of allocating bundles of indivisible objects without transfers arises in many practical settings, including the assignment of courses to students, of siblings to schools, and of truckloads of food to food banks. In these settings, the complementarities in preferences are small compared with the size of the market. We exploit this to design mechanisms satisfying efficiency, envy-free...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2022
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2021.08.002